An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines
نویسندگان
چکیده
The problem of scheduling n unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The algorithm runs in O((logn)2) time and uses O(n'ljlogn) processors.
منابع مشابه
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Consider scheduling of unit jobs with release times and deadlines on m identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tend...
متن کاملOn-Line Scheduling of Parallel Jobs
Abstract. Online scheduling of parallel jobs is a problem where jobs with unit processing time and integer release times and deadlines are scheduled on a set of processors. Every job requests certain number of processors. In our setting processors are organized as a hypercube and jobs are scheduled on subhypercubes of the hypercube. The objective is to schedule as many jobs as possible between ...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملScheduling interval orders with release dates and deadlines
We study the problem of scheduling unit-length tasks with release dates and deadlines subject to precedence constraints and unit communication delays. Two polynomial-time algorithms are de ned: one constructs schedules for graphs with uniform release dates, the other for graphs with arbitrary release dates. They have a special structure: unlike most scheduling algorithms, they do not consider i...
متن کاملOnline Algorithms for Scheduling Unit Jobs
In this abstract we give a short survey of results from [5, 3] on the following unit-job scheduling problem. We are given a set of unit-length jobs, with each job specified by a triple ( ) where and are integral release times and deadlines, and is a non-negative real weight. We have a single machine, i.e., one job can be processed at each integer time. We use the term weighted throughput or gai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 1994